Efficient group key management for multi-privileged groups
نویسندگان
چکیده
Multi-privileged group communications containing multiple data streams have been studied in the traditional wired network environment and the Internet. With the rapid development of mobile and wireless networks and in particular mobile ad-hoc networks (MANETs), the traditional Internet has been integrated with mobile and wireless networks to form the mobile Internet. The multi-privileged group communications can be applied to the mobile Internet. Group users can subscribe to different data streams according to their interest and have multiple access privileges with the support of multi-privileged group communications. Security is relatively easy to be guaranteed in traditional groups where all group members have the same privilege. On the other hand, security has been a challenging issue and is very difficult to handle in multi-privileged groups. In this paper, we first introduce some existing rekeying schemes for secure multi-privileged group communications and analyze their advantages and disadvantages. Then, we propose an efficient group key management scheme called ID-based Hierarchical Key Graph Scheme (IDHKGS) for secure multi-privileged group communications. The proposed scheme employs a key graph, on which each node is assigned a unique ID according to access relations between nodes. When a user joins/leaves the group or changes its access privileges, other users in the group can deduce the new keys using one-way function by themselves according to the ID of joining/leaving/changing node on the graph, and thus the proposed scheme can greatly reduce the rekeying overhead. 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Multiway Tree-Based Group Key Management Using Chinese Remainder Theorem for Multi-Privileged Group Communications
Key management becomes more difficult in multi-privileged communications due to the dynamic membership and the complex relations between users and resources. In this paper, we propose a novel key management scheme in which the key graph is based on multiway trees. Chinese remainder theorem is employed to combine some encrypted rekeying materials into a short message for rekeying. As a result, u...
متن کاملNon-Split Balancing Higher Order Tree for multi-privileged groups
In group communication scenario, key management is important to preserve forward and backward secrecy. In order to achieve it keys need to be changed during user join/leave which is done by an operation called rekeying. In a centralized key management scheme, the server thereafter passes the new keys to the existing users who are affected via unicasts and multicasts. The number of unicasts and ...
متن کاملCipher text policy attribute based broadcast encryption for multi-privileged groups
In the current globalization scenario, many group communication applications have become vital and the users not only subscribe to a single resource, but they use multiple resources and hence ending up with multi-privileged groups. In some group communication applications, it is desirable to encrypt the contents without exact knowledge of the set of intended receivers. Attribute based encryptio...
متن کاملDesign of ID-based Contributory Key Management Scheme using Elliptic Curve Points for Broadcast Encryption
Broadcast encryption is the process of delivering encrypted data through a secure channel, intended for multiple users, in which only the privileged users can decrypt the content. In a broadcasting system, all the intended recipients are required to be accommodated in an organized way, which is possible through an efficient key management scheme. An ideal Broadcast Encryption scheme should defi...
متن کاملAdverse Impact of Fairness on Efficient Outcomes of Resource Allocation Decisions
Two experiments were conducted to investigate the impact of fairness on the efficiency of resource allocation decisions. In Experiment 1 participants allocated payoffs to one privileged and one unprivileged group in a multi-stage decision task. Conflicts between fairness and resource preservation were induced. Selfinterest was varied by awarding participants a high or low bonus if a majority of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 30 شماره
صفحات -
تاریخ انتشار 2007